Derivative of the exponential mapping for infinite dimensional lie groups

It is proved that for infinite dimensional Lie groups in the sense of the differential calculus of Frölicher and Kriegl the derivative of the exponential mappings is given by the formula d(exp)(X)Y=d_exp(X)(e) ₀ ¹ Ad_exp(–tX) Y dt, where stands for the left translation ande is the neutral element.This work was supported by the Alexander von Humboldt-Stiftung.     

A quadratically convergent O(\sqrt n L)-iteration algorithm for linear programming

Recently, Ye, Tapia and Zhang (1991) demonstrated that Mizuno—Todd—Ye's predictor—corrector interior-point algorithm for linear programming maintains the O( L)-iteration complexity while exhibiting superlinear convergence of the duality gap to zero under the assumption that the iteration sequence converges, and quadratic convergence of the duality gap to zero under the assumption of nondegeneracy. In this paper we establish the quadratic convergence result without any assumption concerning the convergence of the iteration sequence or nondegeneracy. This surprising result, to our knowledge, is the first instance of a demonstration of polynomiality and superlinear (or quadratic) convergence for an interior-point algorithm which does not assume the convergence of the iteration sequence or nondegeneracy.Supported in part by NSF Grant DDM-8922636 and NSF Coop. Agr. No. CCR-8809615, the Iowa Business School Summer Grant, and the Interdisciplinary Research Grant of the University of Iowa Center for Advanced Studies.Supported in part by NSF Coop. Agr. No. CCR-8809615, AFOSR 89-0363, DOE DEFG05-86ER25017 and ARO 9DAAL03-90-G-0093.Supported in part by NSF Grant DMS-9102761 and DOE Grant DE-FG05-91ER25100.     

Ketu and the second invariant of a quadratic space

Using the Chern classes defined by Grothendieck, we map aK-theoretic invariant of invertible symmetric matrices defined by Giffen to the Clifford invariant.According to Herrmann Graßman'sWörterbuch zum Rig-veda, Ketu may not be connected with K₂ but es bezeichnet das, was sich sichtbar oder kenntlich macht ...     

C 1 surface interpolation with constraints

Givenn pairwise distinct and arbitrarily spaced pointsP _i in a domainD of thex–y plane andn real numbersf _i, consider the problem of computing a bivariate functionf(x, y) of classC ¹ inD whose values inP _i are exactlyf _i,i=1,,n, and whose first or second order partial derivatives satisfy appropriate equality and inequality constraints on a given set ofp pointsQ _l inD.In this paper we present a method for solving the above problem, which is designed for extremely large data sets. A step of this method requires the solution of a large scale quadratic programming (QP) problem.The main purpose of this work is to analyse an iterative method for determining the solution of this QP problem: such a method is very efficient and well suited for parallel implementation on a multiprocessor system.Work supported by MURST Project of Computational Mathematics, Italy.     

将A-L理论推广到无限维李代数

为使由Alhassid与Levine所提出的动力学李代数方法（简称A－L理论）能适用于更多的散射体系，在h(∞)中引入了有效集合C（有限维）的概念．按照微扰理论的意义，C中的代数元所对应的群参量是较低次微扰的结果，而不属于C的代数元所对应的群参量则相当于较高次做扰所产生的修正结果．因此可以近似地利用C来代替h(∞)．这样，不仅简化了计算程序并且对于很多具有现实意义的散射过程的计算成为可能．     

共线散射体系A+BC的平-振能量传递──无限维李代数处理方法

利用无限维李代数方法处理了在BC分子能谱中含有二级与三级非简谐项的散射体系A＋BC的平-振能量传递问题，获得了散射过程的含有主要动力学参量的跃迁矩阵元和跃迁几率的解析表达式     

取代苯体系的二阶非线性光学性质:动力学李代数方法

提出了一种动力学李代数方法来研究取代苯体系的非线性光学性质. 对于给定的PPP模型(Pariser-Parr-Pople)哈密顿量, 生成了一个动力学李代数. 依据这些代数元构造出演化算子作为群参数的函数, 通过求解一组非线性微分方程能够得到这些群参数. 再按照统计力学中的密度算子公式给出取代苯分子体系偶极矩的统计平均值. 于是导出二阶极化率的表达式. 与其他量子力学计算结果比较, 表明这种动力学李代数方法在预言有机共轭分子的非线性光学性质上同样有用.     

Dynamic Lie algebraic formulation of second‐order optical nonlinearity for substituted benzenes

A dynamic Lie algebraic (DLA) formulation is applied to the study of nonlinear optical properties of the substituted benzenes. We have described the generation of the dynamic Lie algebra for the model Hamiltonian used in the present study. In terms of these elements of the dynamic algebra we express the evolution operator as a function of the group parameters, which can be determined by means of solving a system of coupled nonlinear differential equations. Thus, in terms of the density matrix operator formalism in statistical mechanics we obtain the statistical averages of the electric polarization and then derive readily an expression for the hyperpolarizability of the paradisubstituted benzenes. Comparisons with experimental observations and other quantum calculations of the hyperpolarizabilities for the paradisubstituted benzenes are made qualitatively and quantitatively. These results imply that the DLA method appears useful in describing the nonlinear optical phenomena in the substituted benzene molecules. © 2003 Wiley Periodicals, Inc. Int J Quantum Chem 93: 335–343, 2003     

Mixed strategy solutions forN-person quadratic games

Mixed strategy -equilibrium points are given forN-person games with cost functions consisting of quadratic, bilinear, and linear terms and strategy spaces consisting of closed balls in Hilbert spaces. The results are applied to linear-quadratic differential games with no information and quadratic integral constraints on the control functions.This work was supported by a Commonwealth of Australia, Postgraduate Research Award.     

Efficient algorithms for solving rank two and rank three bilinear programming problems

Finitely convergent algorithms for solving rank two and three bilinear programming problems are proposed. A rank k bilinear programming problem is a nonconvex quadratic programming problem with the following structure: % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXatLxBI9gBaerbd9wDYLwzYbItLDharqqtubsr% 4rNCHbGeaGqiVu0Je9sqqrpepC0xbbL8F4baFfea0dXde9vqpa0lb9% cq0dXdb9IqFHe9FjuP0-iq0dXdbba9pe0lb9hs0dXda91qaq-xfr-x% fj-hmeGabaqaciGacaGaaeqabaWaaeaaeaaakeaaieaacaWFTbGaa8% xAaiaa-5gacaWFPbGaa8xBaiaa-LgacaWF6bGaa8xzaiaa-bcacaWF% 7bacbiGaa43yamaaDaaaleaacaGFWaaabaGaa4hDaaaakiaa+Hhaca% GFRaGaa4hzamaaDaaaleaacaGFWaaabaGaa4hDaaaakiaa+LhacaGF% RaWaaabuaeaacaGFJbWaa0baaSqaaiaa+PgaaeaacaGF0baaaOGaam% iEaiabl+y6NjaadsgadaqhaaWcbaGaamOAaaqaaiaadshaaaGccaWG% 5bGaaiiFaaWcbaGaa8NAaiaa-1dacaWFXaaabeqdcqGHris5aOGaa4% hEaiabgIGiolaa+HfacaGFSaGaa4xEaiabgIGiolaa+LfacaWF9bGa% a8hlaaaa!5D2E!\[minimize \{ c_0^t x + d_0^t y + \sum\limits_{j = 1} {c_j^t xd_j^t y|} x \in X,y \in Y\} ,\]where X Rⁿ¹ and Y R ⁿ² are non-empty and bounded polytopes. We show that a variant of parametric simplex algorithm can solve large scale rank two bilinear programming problems efficiently. Also, we show that a cutting-cake algorithm, a more elaborate variant of parametric simplex algorithm can solve medium scale rank three problems.This research was supported in part by Grant-in-Aid for Scientific Research of the Ministry of Education, Science and Culture, Grant No. 63490010.